Finite-State Markov Chain Approximation for Geometric Mean of MIMO Eigenmodes
نویسندگان
چکیده
Time-varying nature of mobile fading channels can affect the design of wireless systems in many different aspects. This paper investigates the dynamic behavior of intrinsic spatial links in multiple-input multiple-output (MIMO) transceivers based on Geometric mean decomposition (GMD). In particular, we suggest using a finite-state Markov chain (FSMC) to model the fluctuations of both eigenmodes geometric mean and capacity for MIMO-GMD schemes in Rayleigh fading channels. In order to compute the transition probabilities analytically, a number of related statistical distributions are developed and employed. Simulation results have illustrated that FSMC can provide accurate approximations. Keywords-MIMO; Geometric mean decomposition; Rayleigh fading; Markov model.
منابع مشابه
Relative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملAN APPLICATION OF TRAJECTORIES AMBIGUITY IN TWO-STATE MARKOV CHAIN
In this paper, the ambiguity of nite state irreducible Markov chain trajectories is reminded and is obtained for two state Markov chain. I give an applicable example of this concept in President election
متن کاملExtended Geometric Processes: Semiparametric Estimation and Application to ReliabilityImperfect repair, Markov renewal equation, replacement policy
Lam (2007) introduces a generalization of renewal processes named Geometric processes, where inter-arrival times are independent and identically distributed up to a multiplicative scale parameter, in a geometric fashion. We here envision a more general scaling, not necessar- ily geometric. The corresponding counting process is named Extended Geometric Process (EGP). Semiparametric estimates are...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملDiffusion Approximation for Bayesian Markov Chains
Given a Markov chain with uncertain transition probabilities modelled in a Bayesian way, we investigate a technique for analytically approximating the mean transition frequency counts over a finite horizon. Conventional techniques for addressing this problem either require the enumeration of a set of generalized process "hyperstates" whose cardinality grows exponentially with the terminal horiz...
متن کامل